#include<bits/stdc++.h>
#define ll long long
#define L x<<1
#define R x<<1|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,ln
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(int x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=3e5+10,M=7e6+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,V,k;
string s;
struct node{
    int l,r,x;
}a[N];
inline char get(int x){
    per(i,m,1){
        int l=a[i].l,r=a[i].r,p=a[i].x;
        if(p>=x)continue;
        int Ll=p+1,Rr=Ll+r-l;
        if(x>Rr)x-=r-l+1;
        else x=l+x-Ll;
    }
    return s[x];
}
inline void Main(){
	k=read(),V=read(),cin>>s,n=s.length(),s='#'+s,m=read();
    repm(i)a[i].l=read()+1,a[i].r=read(),a[i].x=read();
    rep(i,1,k)putchar(get(i));
}
signed main(){
	freopen("copy.in","r",stdin);
	freopen("copy.out","w",stdout);
	int T=1;
	while(T--)Main();
	return 0;
}